Information Loss in an Optimal Maximum Likelihood Decoding
نویسندگان
چکیده
منابع مشابه
Information Loss in an Optimal Maximum Likelihood Decoding
The mutual information between a set of stimuli and the elicited neural responses is compared to the corresponding decoded information. The decoding procedure is presented as an artificial distortion of the joint probabilities between stimuli and responses. The information loss is quantified. Whenever the probabilities are only slightly distorted, the information loss is shown to be quadratic i...
متن کاملAn Efficient Quasi-Maximum Likelihood Decoding for Finite Constellations
In Multi-Input Multi-Output (MIMO) systems, maximum-likelihood (ML) decoding is equivalent to finding the closest lattice point in an N -dimensional complex space. In general, this algorithm is known to be NP hard. In this paper, we propose a quasi-maximum likelihood algorithm based on Semi-Definite Programming (SDP). We introduce several SDP relaxation models for MIMO systems, with increasing ...
متن کاملEllipsoidal lists and maximum-likelihood decoding
We study an interrelation between the coverings generated by linear ( )–codes and complexity of their maximum-likelihood (ML) decoding. First, discrete ellipsoids in the Hamming spaces are introduced. These ellipsoids represent the sets of most probable error patterns that need to be tested in soft-decision ML decoding. We show that long linear ( )-codes surrounded by ellipsoids of exponential ...
متن کاملFountain Codes under Maximum Likelihood Decoding
This dissertation focuses on fountain codes under maximum likelihood (ML) decoding. Fountain codes are a class of erasure correcting codes that can generate an endless amount of coded symbols and were conceived to deliver data files over data networks to a potentially large population of users. First Luby transform (LT) codes are considered, which represent the first class of practical fountain...
متن کاملNear Maximum Likelihood Decoding with Deep Learning
A novel and efficient neural decoder algorithm is proposed. The proposed decoder is based on the neural Belief Propagation algorithm and the Automorphism Group. By combining neural belief propagation with permutations from the Automorphism Group we achieve near maximum likelihood performance for High Density Parity Check codes. Moreover, the proposed decoder significantly improves the decoding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computation
سال: 2002
ISSN: 0899-7667,1530-888X
DOI: 10.1162/089976602317318947